From Database Repair Programs to Consistent Query Answering in Classical Logic (extended abstract)

نویسنده

  • Leopoldo E. Bertossi
چکیده

Consistent answers to a query from an inconsistent database are answers that can be simultaneously retrieved from every possible repair; and repairs are consistent instances that minimally differ from the original instance. Database repairs can be specified as the stable models of a disjunctive logic program. In this paper we show how to use the repair programs to transform the problem of consistent query answering into a problem of reasoning wrt a concrete theory written in second-order predicate logic. It also investigated how a first-order theory can be obtained instead, by applying second-order quantifier elimination techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Repair Programs and their Evaluation for Consistent Query Answering in Databases

Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired ICs, and the database can still give some correct answers to queries wrt those ICs. Consistent query answers are characterized as ordinary answers obtained from every minimally repaired and consistent version of the d...

متن کامل

Explaining Query Answers under Inconsistency-Tolerant Semantics over Description Logic Knowledge Bases (Extended Abstract)

The problem of querying description logic (DL) knowledge bases (KBs) using database-style queries (in particular, conjunctive queries) has been a major focus of recent DL research. Since scalability is a key concern, much of the work has focused on lightweight DLs for which query answering can be performed in polynomial time w.r.t. the size of the ABox. The DL-Lite family of lightweight DLs [10...

متن کامل

Inconsistency-tolerant query answering in ontology-based data access

Ontology-based data access (OBDA) is receiving great attention as a new paradigm for managing information systems through semantic technologies. According to this paradigm, a Description Logic ontology provides an abstract and formal representation of the domain of interest to the information system, and is used as a sophisticated schema for accessing the data and formulating queries over them....

متن کامل

Some Research Directions in Consistent Query Answering: A Vision

Research in consistent query answering (CQA) in databases was initiated in the database community with the publication of [1], where the main goal was to formalize the notion of consistent answer to a query posed to a possibly inconsistent database, i.e. that fails to satisfy a given set of integrity constraints (ICs) that are not enforced by the system. For many reasons [9], such inconsistenci...

متن کامل

From Classical to Consistent Query Answering under Existential Rules

We consider the well-known setting of ontology-based query answering. In real-life applications, involving large amount of data, it is possible that the data are inconsistent with the ontology. Since standard ontology languages adhere to the classical first-order logic semantics, inconsistencies are nothing else than logical contradictions. Therefore, the classical inference semantics fails ter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009